Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity
نویسندگان
چکیده
منابع مشابه
Higher-Order Linear Ramified Recurrence
Higher-Order Linear Ramified Recurrence (HOLRR) is a PTIME sound and complete typed lambda caluclus. Its terms are those of a linear (affine) λ-calculus – every variable occurs at most once – extended with a limited recursive scheme on a word algebra. Completeness for PTIME holds by embedding Leivant’s ramified recurrence on words into HOLRR. Soundness is established at all types – and not only...
متن کاملLinear Ramified Higher Type Recursion and Parallel Complexity
A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactly characterize the parallel complexity class NC. This is achieved by use of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint.
متن کاملComputational Complexity of Higher Type Functions
The customary identification of feasible with polytime is discussed, Next, higher type functions are presented as a way of giving computational meaning to theorems. In particular, if a theorem has a "feasibly constructive" proof, the associated functions should be polytime. However examples are given to illustrate the difficulty of capturing the notion of polytime for higher type functions. Fin...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولConfidence bounds of recurrence-based complexity measures
a r t i c l e i n f o a b s t r a c t In the recent past, recurrence quantification analysis (RQA) has gained an increasing interest in various research areas. The complexity measures the RQA provides have been useful in describing and analysing a broad range of data. It is known to be rather robust to noise and nonstationarities. Yet, one key question in empirical research concerns the confide...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1999
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(98)00040-2